Performance evaluation of path searching heuristics for multicast QoS routing
نویسندگان
چکیده
Quality of Service routing for multicast enables a group member to find and install a branch of the multicast tree that can meet its QoS constraints. The most promising protocols in this area use receiver-oriented path searching heuristics to find feasible routes. In this paper, we examine the performance of the path searching heuristics used by these protocols, to determine which techniques are the most effective. We find that several low-overhead path searching heuristics are effective, and that generic path searching can work as well as targeted, QoS-specific searching.
منابع مشابه
An Approach for Quality of Service Based Multicast Routing
In this report, we present a general framework for the problem of QoS multicast and unicast routing with resource allocation. Our framework uses functional forms derived from various queuing service disciplinesfor the QoS parameters rather than static metrics. We give formal definitions of the QoS multicast and unicast routing with resource allocation problems. This problem formulation is diffe...
متن کاملEvaluation of multicast routing algorithms for real-time communication on high-speed networks
Multicast (MC) routing algorithms capable of satisfying the QoS requirements of real-time applications will be essential for future high-speed networks. We compare the performance of all of the important MC routing algorithms when applied to networks with asymmetric link loads. Each algorithm is judged based on the quality of the MC tree it generates and its e ciency in managing the network res...
متن کاملThe Multicast Routing QoS Based on the Improved ACO Algorithm
For the search of the optimal path and the establishment of the multicast tree which meets QoS constraints in multicast routing, an improved ant colony algorithm is proposed in the paper. In the searching process, two group ants carry out searching separately and alternate information after one search. After a period of time, the rotary table is adapted to choosing a path and avoids stagnation,...
متن کاملE$cient multicast routing with delay constraints
To support real-time multimedia applications in BISDN networks, QoS guaranteed multicast routing is essential. Traditional multicast routing algorithms used for solving the Steiner tree problem cannot be used in this scenario, because QoS constraints on links are not considered. In this paper, we present two e$cient source-based multicast routing algorithms in directed networks. The objective o...
متن کاملDesign and Evaluation of a Multi-class Based Multicast Routing Protocol
Most of current multicast QoS routing proposals are based on the principle that QoS routes must be computed for each request, where requests explicitly express their resource requirements. As a result, within this environment, the goal of QoS routing is to satisfy individual request requirements, resorting to resource reservation to maintain those requirements after a feasible path has been fou...
متن کامل